Using Regret Estimation to Solve Games Compactly

Source URL: poker.cs.ualberta.ca

• Game theory
• Academia
• Abstraction
• Mathematics
• Solved game
• Mathematical game
• Computational complexity theory
• Mathematical problem
• Nash equilibrium
• Regression analysis
• Extensive-form game

Operational Definition of Computational Thinking for K–12 Education The International Society for Technology in Education (ISTE) and the Computer Science Teachers Association (CSTA) have collaborated with leaders from

Source URL: csta.acm.org

• Education
• Educational psychology
• Computing
• Euthenics
• Computational thinking
• Computer Science Teachers Association
• Artificial intelligence
• Computer science
• CSTA
• Problem solving
• Operational definition
• Educational technology

Distribution Regression: Computational-Statistical Efficiency Tradeoff∗ Zolt´an Szab´o (Gatsby Unit, University College London) Abstract: In this talk I am going to focus on the distribution regression problem: regr

Source URL: www.gatsby.ucl.ac.uk

8th Problem Set for the MDS Block Course on High-Dimensional Computational Geometry Helmut Alt, Wolfgang Mulzer Summer 2013

Source URL: www.inf.fu-berlin.de

Maximizing Submodular Set Function with Connectivity Constraint: Theory and Application to Networks Tung-Wei Kuo† ‡ , Kate Ching-Ju Lin† , and Ming-Jer Tsai‡ † Research Center for Information Technology Innova

Source URL: nms.citi.sinica.edu.tw

• Mathematics
• Graph theory
• Computational complexity theory
• Combinatorial optimization
• Submodular set function
• Edsger W. Dijkstra
• NP-complete problems
• Algorithm
• Shortest path problem
• HeldKarp algorithm
• Dominating set

A PARTICLE SWARM OPTIMIZATION HYPER-HEURISTIC FOR THE DYNAMIC VEHICLE ROUTING PROBLEM Michal Okulewicz, Jacek Ma´ ndziuk Faculty of Mathematics and Information Science, Warsaw University of Technology,

Source URL: bioma.ijs.si

• Operations research
• Mathematical optimization
• Mathematics
• Applied mathematics
• Computational complexity theory
• NP-complete problems
• Cybernetics
• Evolutionary algorithms
• Ant colony optimization algorithms
• Particle swarm optimization
• Swarm intelligence
• Hyper-heuristic

7th Problem Set for the MDS Block Course on High-Dimensional Computational Geometry Helmut Alt, Wolfgang Mulzer Summer 2013

Source URL: www.inf.fu-berlin.de

4th Problem Set for the MDS Block Course on High-Dimensional Computational Geometry Helmut Alt, Wolfgang Mulzer Summer 2013

Source URL: www.inf.fu-berlin.de

Games, geometry, and [ the computational complexity of ] finding equilibria Bernhard von Stengel Department of Mathematics London School of Economics

Source URL: www.maths.lse.ac.uk

• Computational complexity theory
• Theory of computation
• Complexity classes
• NP
• Matching
• P
• Time complexity
• Decision problem
• P versus NP problem
• 3-dimensional matching

Social Exchange Networks With Distant BargainingI Konstantinos Georgiou1 , George Karakostas2,∗, Jochen K¨onemann1 , Zuzanna Stamirowska3 Abstract Network bargaining is a natural extension of the classical, 2-player N

Source URL: www.cas.mcmaster.ca

• Computational complexity theory
• Game theory
• Theory of computation
• Computational problems
• Cooperative game theory
• Core
• NC
• Optimization problem